On Irregularity Measures of Some Dendrimers Structures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Some Irregularity Measures of Graphs

Let Γ(G) be a set of all simple graphs of order n and sizem, without isolated vertices, with vertex degree sequence d1 ≥ d2 ≥ ·· · ≥ dn > 0. A graph G is regular if and only if d1 = d2 = · · ·= dn. Each mapping Irr : Γ(G) 7→ [0,+∞) with the property Irr(G) = 0 if and only if G is regular, is referred to as irregularity measure of graph. In this paper we introduce some new irregularity measures ...

متن کامل

On the Irregularity of Some Molecular Structures

Measures of the irregularity of chemical graphs could be helpful for QSAR/QSPR studies and for the descriptive purposes of biological and chemical properties, such as melting and boiling points, toxicity and resistance. Here we consider the following four established irregularity measures: the irregularity index by Albertson, the total irregularity, the variance of vertex degrees and the Collat...

متن کامل

On the Variance-Type Graph Irregularity Measures

Bell's degree-variance Var$!{}_{B}$ for a graph $G$, with the degree sequence ($d_1,d_2,cdots,d_n$) and size $m$, is defined as$Var!_{B} (G)=frac{1}{n} sum _{i=1}^{n}left[d_{i} -frac{2m}{n}right]^{2}$.In this paper, a new version of the irregularity measures of variance-type, denoted by $Var_q$, is introduced and discussed. Based on a comparative study, it is demonstrated that the n...

متن کامل

Irregularity Measures of Graph

Let G = (V,E), V = {1,2, . . . ,n}, be a simple graph without isolated vertices, with vertex degree sequence d1 ≥ d2 ≥ ·· · ≥ dn > 0, di = d(i). A graph G is regular if and only if d1 = d2 = · · · = dn. A graph invariant I(G) is measure of irregularity of graph G with the property I(G) = 0 if and only ifG is regular, and I(G)> 0 otherwise. In this paper we introduce some new irregularity measures.

متن کامل

Flow Polynomial of some Dendrimers

Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2019

ISSN: 2227-7390

DOI: 10.3390/math7030271